Steganography via MIDI Files by Adjusting Velocities of Musical Note Sequences With Monotonically Non-Increasing or Non-Decreasing Pitches
نویسندگان
چکیده
منابع مشابه
Automatic Reduction of MIDI Files Preserving Relevant Musical Content
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring musical similarity, but also heavily on the number and sizes of files in the database. One way to speed up music retrieval is to reduce the search space by removing redundant and uninteresting material in the database. We ...
متن کاملEstimating Musical Time Information from Performed MIDI Files
Even though originally developed for exchanging control commands between electronic instruments, MIDI has been used as quasi standard for encoding and storing scorerelated parameters. MIDI allows for representing musical time information as specified by sheet music as well as physical time information that reflects performance aspects. However, in many of the available MIDI files the musical be...
متن کاملKnots cascade detected by a monotonically decreasing sequence of values
Due to reconnection or recombination of neighboring strands superfluid vortex knots and DNA plasmid torus knots and links are found to undergo an almost identical cascade process, that tend to reduce topological complexity by stepwise unlinking. Here, by using the HOMFLYPT polynomial recently introduced for fluid knots, we prove that under the assumption that topological complexity decreases by...
متن کاملPredicting Hit Songs with MIDI Musical Features
This paper predicts hit songs based on musical features from MIDI files. The task is modeled as a binary classification problem optimizing for precision, with Billboard ranking as labels. Million Song Dataset (MSD) is inspected audibly, visually, and with a logistic regression model. MSD features is determined too noisy for the task. MIDI files encodes pitch duration as separate instrument trac...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2948493